Search Results/Filters    

Filters

Year

Banks



Expert Group











Full-Text


Issue Info: 
  • Year: 

    2023
  • Volume: 

    11
  • Issue: 

    2
  • Pages: 

    221-228
Measures: 
  • Citations: 

    0
  • Views: 

    30
  • Downloads: 

    4
Abstract: 

GRAPH representation of data can better define relationships among data components and thus provide better and richer analysis. So far, movies have been represented in GRAPHs many times using different features for clustering, genre prediction, and even for use in recommender systems. In constructing movie GRAPHs, little attention has been paid to their textual features such as subtitles, while they contain the entire content of the movie and there is a lot of hidden information in them. So, in this paper, we propose a method called MoGaL to construct movie GRAPH using LDA on subtitles. In this method, each node is a movie and each edge represents the novel relationship discovered by MoGaL among two associated movies. First, we extracted the important topics of the movies using LDA on their subtitles. Then, we visualized the relationship between the movies in a GRAPH, using the cosine similarity. Finally, we evaluated the proposed method with respect to measures genre homophily and genre entropy. MoGaL succeeded to outperforms the baseline method significantly in these measures. Accordingly, our empirical results indicate that movie subtitles could be considered a rich source of informative information for various movie analysis tasks.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 30

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 4 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2024
  • Volume: 

    15
  • Issue: 

    3
  • Pages: 

    123-135
Measures: 
  • Citations: 

    0
  • Views: 

    12
  • Downloads: 

    0
Abstract: 

‎In this paper‎, ‎we define the zero-divisor GRAPH of a meet-hyperlattice‎ with respect to a hyperideal‎. ‎We prove the diameter of a $P-$hyperlattice and Nakano‎ hyperlattice are at most 3 and 4 respectively‎. ‎We obtain that the zero-divisor‎ GRAPH with respect to the intersection of two prime hyperideals is complete bipartite‎. ‎We‎ prove certain properties of these zero-divisor GRAPHs with suitable examples.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 12

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2022
  • Volume: 

    7
  • Issue: 

    2
  • Pages: 

    181-202
Measures: 
  • Citations: 

    0
  • Views: 

    198
  • Downloads: 

    24
Abstract: 

Purpose: The future of the CONSTRUCTION industry is increasingly influenced by new technologies. In order to adopt appropriate strategies in facing new technologies, it is necessary to know the possible futures of the CONSTRUCTION industry. This research was done with the aim of explaining the technological uncertainties and compiling the future scenarios of the CONSTRUCTION industry.  Method: The research method is applied and was carried out with a combination of quantitative and qualitative methods. First, the library study was used to determine the technological drivers, then the Structural Analysis was used to explain the technological uncertainties, and finally, the Schwartz method was used to compile the scenarios. The statistical population is experts of CONSTRUCTION industry. Findings: Nine technological uncertainties affecting the future of the CONSTRUCTION industry have been identified and for each of them, three states of decline, stagnation and progress have been considered. Data analysis by Scenario Wizard shows eight probable scenarios. The portfolio of scenarios including four groups of progress scenarios, towards progress, towards stagnation, and towards wane has been compiled. Conclusion: In the progress scenario, the 89% of uncertainties have developed. In  towards progress, 56% of the factors are in the development status, which indicates the development of the technological factor application. In the stagnation scenario, no progress has been made in the application of uncertainties and they are in a static state. In towards wane, uncertainties have been placed in a situation of reduced use.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 198

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 24 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2025
  • Volume: 

    51
  • Issue: 

    1
  • Pages: 

    19-40
Measures: 
  • Citations: 

    0
  • Views: 

    22
  • Downloads: 

    0
Abstract: 

Objective: The increase in ecological vulnerability in cities due to rising temperatures has received much attention in recent years. Accurate identification of the urban heat island network is very important for effectively reducing its impact. In many studies, the impact of heat island connectivity on these networks has been largely ignored. This study was conducted to fill this research gap by creating an urban heat island network based on the connectivity perspective to understand the structural characteristics of the effect of this network and evaluate it in order to determine the priority level for implementing temperature reduction measures in the Tehran metropolis.Method: To achieve the above goal, after analyzing the ground surface temperature, areas with high temperatures were identified. Then, morphological spatial pattern analysis, morphological structure evaluation, and recognition of the importance of heat island sources were carried out. In the next stage, the resistance level against thermal diffusion was constructed, and, then, using the minimum cumulative resistance method, heat transfer corridors were identified and analyzed.Results: The findings of this study identified 29 strong heat island cores in Tehran with a relatively scattered distribution, 8 of which showed very high heating power. 31 corridors connected these islands, 10 of which had the potential to increase temperatures significantly. In addition, in terms of spatial distribution, the heat island network fragments in Tehran were more densely located in the western and southern areas. The high density of heat islands in the western part of Tehran made planning to combat them more difficult and increased their influence. Also, the very dense islands located in the southwest of Tehran led to the identification of short heat corridors in this part of the city, which justified the increase in temperature. On the other hand, the results showed that the cores had the largest share in the heat island network in Tehran, which indicated the size of the heat islands and their regional distribution in the study area.Conclusions: In this study, special attention has been paid to the structural characteristics of the urban heat islands of the study area and their degree of importance. This approach is simpler than previous methods of determining the size or density of blue-green spaces to achieve cooling effects. This framework can be used as a strategic measure to prevent the coalescence and expansion of urban heat islands and to avoid the unplanned increase of blue-green spaces aimed at reducing temperatures in urban areas.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 22

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2022
  • Volume: 

    12
  • Issue: 

    47
  • Pages: 

    75-93
Measures: 
  • Citations: 

    0
  • Views: 

    160
  • Downloads: 

    11
Abstract: 

Background: The expansion of the use of audio and video media technology has faced society with many medical, cultural and economic challenges. In the meantime, excessive use of mobile phones can cause many problems. Objective: The aim of this study was to construct and validate a questionnaire on physical and psychological injuries of mobile phones. Method: The method of the present study was descriptive-correlational and confirmatory factor analysis. The statistical population of the study consisted of all citizens of Khorramabad with a diploma or higher in 1399, which was selected as a statistical sample by available sampling method of 200 people online and virtual. Results: The results showed that the factorized physical and psychological harm questionnaire of cell phone with 42 questions and 10 components (fear of loss, vibration syndrome, duck syndrome, nomophobia, insomnia, hearing problem, eye syndrome, tunnel and neck syndrome SMS) and has good reliability, validity and flexibility in terms of psychometrics. Discussion and Conclusion: The questionnaire of factor analysis of physical and psychological injuries of mobile phones can be used to identify and study the physical and psychological injuries of mobile phones.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 160

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 11 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2012
  • Volume: 

    3
  • Issue: 

    1
  • Pages: 

    81-94
Measures: 
  • Citations: 

    0
  • Views: 

    796
  • Downloads: 

    186
Abstract: 

The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the GRAPH of this molecule and plot the GRAPH by spring layout algorithm in GRAPHviz and networks packages. The similarity between the shape of this molecule and the plotted GRAPH is a consequence of our work. Furthermore, the Wiener, Szeged and PI indices of this molecule are computed.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 796

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 186 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2025
  • Volume: 

    20
  • Issue: 

    1
  • Pages: 

    125-130
Measures: 
  • Citations: 

    0
  • Views: 

    8
  • Downloads: 

    0
Abstract: 

The independence GRAPH Ind(G) of a GRAPH G is the GRAPH with vertices as maximum independent sets of G and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence GRAPH of Cartesian product of d copies of complete GRAPHs Kq, which is known as the Hamming GRAPH H(d, q). Greenwell and Lovasz [7] found that the independence number of direct product of d copies of Kq as qd−1. We prove that the independence number of Hamming GRAPH H(d, q), which is cartesian product of d copies of Kq, is also qd−1. As an application of our findings, we find answers for rook problem in higher dimensional square chess board.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 8

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2012
  • Volume: 

    1
  • Issue: 

    1
  • Pages: 

    31-34
Measures: 
  • Citations: 

    0
  • Views: 

    1112
  • Downloads: 

    209
Abstract: 

In this paper, we find the star chromatic number of central GRAPH of complete bipartite GRAPH and corona GRAPH of complete GRAPH with path and cycle.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 1112

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 209 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Khojasteh Soheila

Issue Info: 
  • Year: 

    2023
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    141-149
Measures: 
  • Citations: 

    0
  • Views: 

    69
  • Downloads: 

    15
Abstract: 

Let R be a commutative ring and M be an R-module. The M-intersection GRAPH of ideals of R, denoted by GM(R) is a GRAPH with the vertex set I(R) ∗, , and two distinct vertices I and J are adjacent if and only if IM ∩,JM ̸, = 0. In this paper, we study GR/J (R/I), where I and J are ideals of R and I ⊆,J. We characterize all ideals I and J for which GR/J (R/I) is planar, outerplanar or ring GRAPH.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 69

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 15 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2023
  • Volume: 

    8
  • Issue: 

    4
  • Pages: 

    631-637
Measures: 
  • Citations: 

    0
  • Views: 

    45
  • Downloads: 

    0
Abstract: 

Let $G=(V,E)$ be a GRAPH of order $n$ and size $m.$ The GRAPH $Sp(G)$ obtained from $G$ by adding a new vertex $v'$ for every vertex $v\in V$ and joining $v'$ to all neighbors of $v$ in $G$ is called the splitting GRAPH of $G.$ In this paper, we determine the domination number, the total domination number, connected domination number, paired domination number and independent domination number for the splitting GRAPH $Sp(G).$

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 45

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button